Unifying Performance Metric of Viterbi Decoders

نویسنده

  • Feipei Lai
چکیده

Convolutional codes and Viterbi decoders were extensively used in error control systems. The survivor memory management (SMM) unit of Viterbi decoder is extremely important in determining the throughput, hardware area and coding gain performance of the whole system. Many SMM architectures were proposed in the past, but we lack an unifying metric to compare the coding gain performance of them. In this thesis, we define a metric, average traceback depth (ATBD), to unify the diversity of different SMM architectures. The ATBD metric can be used to equalize different SMM architectures and predict the optimal traceback depth (TBD) of them. The optimality is in terms of coding gain performance and hardware cost. We perform extensive computer simulations with three popular convolutional codes (DVB, DCII and UMTS) and many SMM architectures to verify the validity of the ATBD metric. Simulation results show that the difference between optimal TBD and ATBD is at most 10%. With this unifying metric, we can estimate the hardware cost of different SMM architectures under fixed coding gain performance. Besides, system architects can use it to fast evaluate the tradeoff among hardware cost, throughput and coding gain performance because the calculation of ATBD metric is very simple.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

High Speed Low Power Adaptive Viterbi Decoder Architecture for Underwater Acoustic Communication with Turbo Codes

Underwater acoustic communication module based on Orthogonal Frequency Division Multiplexing (OFDM) uses rate 1⁄2 convolutional encoders and Turbo decoders for error control coding. Turbo decoders are designed with two Viterbi decoders that operate in sequence to improve Log Likelihood Ratio (LLR). The computation complexity of Viterbi decoders limits their use for high speed decoding as the de...

متن کامل

Performance Evaluation of Bpn Based Viterbi Decoder for Decoding 2-bit and 3-bit Errors

In communication, convolution codes are extensively used for reliable data communication at receiver’s end the coded messages are decoded with Viterbi Decoders. However when the channel is noisy decoding becomes computationally complex even with enhanced Viterbi Decoder, hence it necessitates an efficient computationally less complex decoders. In this paper Viterbi Decoders are realized in BPN,...

متن کامل

Insertion/deletion Correction by Using Parallel- Interconnected Viterbi Decoders

A new insertion/deletion correction scheme is presented for standard convolutional codes that makes use of multiple parallel-interconnected Viterbi decoders. Whenever an insertion or deletion error occurs, the connections between different Viterbi decoders ensure that decoding will proceed from the decoder that is in synchronization. In this way, a larger Viterbi decoder is created that can cor...

متن کامل

Speed, Noise Immunity, Power Consumption and Area Comparison between Different Approaches of Low-Power Viterbi Decoder for Digital Wireless Communication Applications

Noise immunity and speed are two vital issues for designing encoding-decoding system for wireless communication. Convolutional coding is widely used in wireless communication system for its error correction property. For the decoding purpose of Convolutional coding Viterbi decoder is used. Core module of Viterbi decoder is Adder-Comparator-Selector (ACS) which takes approximately 70% of total p...

متن کامل

A 500-Mb/s Soft-Output Viterbi Decoder

Two eight-state 7-bit soft-output Viterbi decoders matched to an EPR4 channel and a rate-8/9 convolutional code are implemented in a 0.18m CMOS technology. The throughput of the decoders is increased through architectural transformation of the add-compare-select recursion, with a small area overhead. The survivor-path decoding logic of a conventional Viterbi decoder register exchange is adapted...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004